Linear-Time Recognition of Probe Interval Graphs
نویسندگان
چکیده
منابع مشابه
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where the intervals are partitioned into two sets: probes and non-probes. The graph has an edge between two vertices if they intersect and at least one of them is a ...
متن کاملRecognition of probe proper interval graphs
In a partitioned probe graph the vertex set is partitioned into probes and non-probes, such that the set of non-probes is an independent set. A probe proper interval graph is the intersection graph of a set of intervals on the line such that every vertex is mapped to an interval, no interval contains another, and two vertices are adjacent if and only if the corresponding intervals intersect and...
متن کاملLinear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance and Probe Interval Graphs
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with an interval associated to each vertex so that vertices are adjacent if and only if their corresponding intervals overlap and at least one of them is a probe. A graph G = (V, E) is a tolerance graph if each vertex v ∈ V can be associated to an interval Iv of the real line and a positive real numbe...
متن کاملSimple Linear Time Recognition of Unit Interval Graphs
We present a linear time algorithm for unit interval graph recognition. The algorithm is simple and based on Breadth-First Search. It is also direct | it does not rst recognize the graph as an interval graph. Given a graph G, the algorithm produces an ordering of the vertices of the graph whenever G is a unit interval graph. This order corresponds to the order of the intervals of some unit inte...
متن کاملA linear time recognition algorithm for proper interval graphs
We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian cycle of G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/130930091